Key Agreement Protocols Based on Multivariate Polynomials over Fq

In this paper we propose new key agreement protocols based on multivariate polynomials over finite field Fq. We concretely generate the multivariate polynomial F(X)∈Fq[x1,..,xn] such that F(X)=Σi=1 m ki[Ai(X) d + Ai(X) d-1 + ..+ Ai(X)] where Ai(X) =ai1x1+...+ainxn ,coefficients ki , aij ∈ Fq (i=1,..,m:j=1,..,n) and variables X=(x1,..,xn) T ∈ Fq[x1,..,xn] . The common key K(X) has the form such that K(X)=Σi=1 m hi F((bi1x1,...,binxn) T ) where hi ,bij ∈Fq (i=1,..,m:j=1,..,n) to be the temporary secret keys of the partner . Our system is immune from the Gröbner bases attacks because obtaining coefficients of F(X) to be secret keys arrives at solving the multivariate algebraic equations, that is, one of NP complete problems .Our protocols are also thought to be immune from the differential attacks because of the equations of high degree.